CSSE Technical Report UWA-CSSE-09-002 Arbitrary Gaussian Filtering with 25 Additions and 5 Multiplications per Pixel

Arbitrary Gaussian Filtering with 25 Additions and 5 Multiplications per Pixel

Summed area tables, also known as integral images, allow image averaging to be performed very efficiently at a small fixed cost per pixel, independent of averaging filter size. Repeated filtering with averaging filters can be used to approximate Gaussian filtering. Thus a good approximation to Gaussian filtering can be achieved at a fixed cost per pixel independent of filter size. This note des...

CSSE Technical Report UWA - CSSE - 2010 - 001 March 2010 Learning Classi er Systems for Fraud Detection

Fraud is a serious problem that costs the worldwide economy trillions of dollars annually. However, fraud detection is di cult as perpetrators actively attempt to masquerade their actions, among typically overwhelming large volumes of, legitimate activity. In this paper, we investigate the fraud detection problem and examine how learning classi er systems can be applied to it. We describe the c...

International Conference on Computer Science and Software Engineering, CSSE 2008, Volume 6: Graphic Communication / Other Applications, December 12-14, 2008, Wuhan, China

Defending Against Injection Attacks Through Context-Sensitive String Evaluation

Injection vulnerabilities pose a major threat to applicationlevel security. Some of the more common types are SQL injection, crosssite scripting and shell injection vulnerabilities. Existing methods for defending against injection attacks, that is, attacks exploiting these vulnerabilities, rely heavily on the application developers and are therefore error-prone. In this paper we introduce CSSE,...

Parallel Machine Scheduling Problems with a Single Server

In this paper, we consider the problem of scheduling jobs on parallel machines with setup times. The setup has to be performed by a single server. The objective is to minimize the schedule length (makespan), ss well as the forced idle time. The makespan problem is known to be NP-hard even for the csse of two identical parallel machines. This paper presents a pseudopolynomial algorithm for the c...